Maximum and minimum diagonal sums of doubly stochastic matrices
نویسندگان
چکیده
منابع مشابه
Subdirect sums of doubly diagonally dominant matrices
The problem of when the k-subdirect sum of a doubly diagonally dominant matrix (DDD matrix) is also a DDD matrix is studied. Some sufficient conditions are given. The same situation is analyzed for diagonally dominant matrices and strictly diagonally dominant matrices. Additionally, some conditions are also derived when card(S)>card(S1) which was not studied by Bru, Pedroche and Szyld [Electron...
متن کاملDoubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملRandom doubly stochastic tridiagonal matrices
Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...
متن کاملDiagonal entry restrictions in minimum rank matrices
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
متن کاملVertex degrees and doubly stochastic graph matrices
In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graphmatrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris’ question...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1974
ISSN: 0024-3795
DOI: 10.1016/0024-3795(74)90083-4